A decision support system of vehicle routing and refueling for motor carriers with time-sensitive demands

نویسنده

  • Yoshinori Suzuki
چکیده

a r t i c l e i n f o Given the recent trend of raising fuel cost and the increased time-sensitiveness of shippers, an extensive pressure is placed on the motor-carrier industry to meet the time-constrained customer demands at minimum fuel cost. We propose a decision support system that allows motor carriers to route each vehicle such that the vehicle not only visits all the customers in time (without violating time windows), but also utilizes the " cheapest " gas stations (cheapest truck stops in the region) as refueling points during the tour. While this approach does not necessarily minimize a vehicle's fuel consumption, as it often suggests using non-shortest routes with cheap gas stations (truck stops), it allows the vehicle to reduce the unit cost of buying fuel. Computational testing shows that the proposed approach may attain up to 4.29% savings in fuel cost for motor carriers. U.S. motor carriers, including the asset-based third-party logistics companies (3PLs) and the shippers with private fleets, are currently facing a challenging business environment for two reasons. The first is the raising fuel cost. It is well known that, during the last few years, fuel prices have increased dramatically by more than 100%, and that thousands of U.S. motor carriers went bankrupt because of such price hikes (Transport Topics [13]). The second is the increased time-sensitiveness of customers. Because of the growing use of lean and just-in-time operations in the manufacturing sector (a major customer segment for motor carriers), many shippers are now imposing time-window constraints on their demands (Ohlmann and Thomas [9]). Hence, an extensive pressure is placed on motor carriers to dispatch their pickup and delivery vehicles in such a way that they can meet the time-sensitive customer demands at minimum fuel costs. Many carriers are using the following two strategies to cope with these challenges. The first is to reduce the fuel consumption of each vehicle by scheduling the customer visits such that the total travel distance during a tour can be minimized without violating time windows. This can be accomplished by using the techniques (and the software products) that solve the time-constrained vehicle routing problems (Bell and Griffis [1]). The second is to reduce the unit-cost of buying fuel (cost per gallon). This is usually accomplished by using the " purchase contract " strategy, in which a carrier makes a commitment to buy certain amounts of fuel …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Competitive Vehicle Routing Problem with Time Windows and Stochastic Demands

The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...

متن کامل

A Vehicle Routing Problem with Inventory in a Hybrid Uncertain Environment

Manufacturers, who re-supply a large number of customers, continually struggle with the question of how to formulate a replenishment strategy. The purpose of this paper is to determine the optimal set of routes for a group of vehicles in the transportation network under defined constraints – which is known as the Vehicle Routing Problem (VRP) – delivering new items, and resolving the invent...

متن کامل

DSS of vehicle refueling: A new enhanced approach with fuel weight considerations

a r t i c l e i n f o The fixed-route vehicle-refueling problem (FRVRP) is a mathematical problem widely used in the U.S. trucking industry. The FRVRP seeks the best refueling policy (sequence of fuel stations to use, along with the fueling quantity at each station) for a given (fixed) origin–destination route that minimizes a vehicle's refueling cost. While effective, the current FRVRP methods...

متن کامل

CAPACITATED VEHICLE ROUTING PROBLEM WITH VEHICLES HIRE OR PURCHASE DECISION: MODELING AND SOLUTION APPROACHES

The overall cost of companies dealing with the distribution tasks is considerably affected by the way that distributing vehicles are procured. In this paper, a more practical version of capacitated vehicle routing problem (CVRP) in which the decision of purchase or hire of vehicles is simultaneously considered is investigated. In CVRP model capacitated vehicles start from a single depot simulta...

متن کامل

A New Mathematical Model for the Green Vehicle Routing Problem by Considering a Bi-Fuel Mixed Vehicle Fleet

This paper formulates a mathematical model for the Green Vehicle Routing Problem (GVRP), incorporating bi-fuel (natural gas and gasoline) pickup trucks in a mixed vehicle fleet. The objective is to minimize overall costs relating to service (earliness and tardiness), transportation (fixed, variable and fuel), and carbon emissions. To reflect a real-world situation, the study considers: (1) a co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Decision Support Systems

دوره 54  شماره 

صفحات  -

تاریخ انتشار 2012